Contents Combinatorial Convexity by Víctor Álvarez and Jeong

نویسندگان

  • Julian Pfeifle
  • Víctor Álvarez
  • Jeong Hyeon Park
  • Frederik von Heymann
  • Daria Schymura
  • Benjamin Matschke
  • Bernardo González Merino
  • Maria Saumell
  • Victor Alvarez
چکیده

Erdős-Szekeres theorem is one of classic results in combinatorial geometry. In this project we consider the colored version of the problem. Especially, we are interested in the number of empty monochromatic triangles and the existence of an empty monochromatic convex quadrilateral. We give some minor results and plausible ideas to solve the problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nail-patella syndrome. A case with a de novo mutation in the LMX1B gene not previously described.

Correspondence: Naira Álvarez Martín Sección de Nefrología Pediátrica. Servicio de Pediatría. Hospital Nuestra Señora de la Candelaria. Ctra. General del Rosario s/n. 38010 Santa Cruz de Tenerife. (Spain) [email protected] [email protected] Nail-patella syndrome. A case with a de novo mutation in the LMX1B gene not previously described Naira Álvarez-Martín, María J. Gamundi, Imma Hernan,...

متن کامل

On the log-convexity of combinatorial sequences

Here presented is a survey for the log-convexity of some famous combinatorial sequences. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of q-log-convexity and establish the link with linear transformations preserving the log-convexity. MSC: 05A20; 11B73; 11B83; 11B37

متن کامل

A Criterion for the Log-Convexity of Combinatorial Sequences

Recently, Došlić, and Liu and Wang developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, i...

متن کامل

Substitutes and complements in network flows viewed as discrete convexity

A new light is shed on “substitutes and complements” in the maximum weight circulation problem with reference to the concepts of L-convexity and M-convexity in the theory of discrete convex analysis. This provides us with a deeper understanding of the relationship between convexity and submodularity in combinatorial optimization.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010